A Class of Nonmontone Line Search Method with Perturbations

نویسنده

  • Meixia Li
چکیده

In this paper, a new kind of nonmontone line search method which is called new hybrid projection method with perturbations is proposed. At the same time, global convergence of this kind of method is proved only in the case where the gradient function is uniformly continuous on an open convex set containing the iteration sequence. In doing so, we remove various boundedness conditions. Furthermore, we obtain that the convergence property of gradient-type method with new nonmontone linear search method will not be changed when search directions are perturbed slightly. Numerical examples are given in the third section of this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient improvement of the Newton method for solving nonconvex optimization problems

‎Newton method is one of the most famous numerical methods among the line search‎ ‎methods to minimize functions. ‎It is well known that the search direction and step length play important roles ‎in this class of methods to solve optimization problems. ‎In this investigation‎, ‎a new modification of the Newton method to solve ‎unconstrained optimization problems is presented‎. ‎The significant ...

متن کامل

Multi-Stage Fuzzy Load Frequency Control Based on Multi-objective Harmony Search Algorithm in Deregulated Environment

A new Multi-Stage Fuzzy (MSF) controller based on Multi-objective Harmony Search Algorithm (MOHSA) is proposed in this paper to solve the Load Frequency Control (LFC) problem of power systems in deregulated environment. LFC problem are caused by load perturbations, which continuously disturb the normal operation of power system. The objectives of LFC are to mini small size the transient deviati...

متن کامل

روش به روز رسانی متقارن از مرتبه اول برای حل مسایل بهینه سازی مقیاس بزرگ

The search for finding the local minimization in unconstrained optimization problems and a fixed point of the gradient system of ordinary differential equations are two close problems. Limited-memory algorithms are widely used to solve large-scale problems, while Rang Kuta's methods are also used to solve numerical differential equations. In this paper, using the concept of sub-space method and...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

PERIODIC SOLUTIONS IN CERTAIN CLASS OF 3- DIMENSION DISCONTINUOUS AUTONOMOUS SYSTEMS

In the present paper the linear oscillator in R3 with z =constanthas been considered. The aim is to determine the necessary conditions forthe persistence of periodic solutions under discontinuous perturbations. A newapproach based on a computational method has been used. At the end weapply our method on an example.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012